#include <bits/stdc++.h>
using namespace std;
void solve()
{
string s;
cin >> s;
long long ind = 0;
int g = 0;
for (long long i = 0; i < s.size(); i++)
{
if (s[i] == '[')
{
ind = i;
g++;
break;
}
}
if (g == 0)
{
//cout << "intru1";
cout << -1;
return;
}
long long tmp = g;
for (long long i = ind + 1; i < s.size(); i++)
{
if (s[i] == ':')
{
ind = i;
g++;
break;
}
}
long long left = ind;
if (g == tmp)
{
//cout << "intru2";
cout << -1;
return;
}
tmp = g;
for (long long i = s.size() - 1; i >= ind + 1; i--)
{
if (s[i] == ']')
{
ind = i;
g++;
break;
}
}
if (g == tmp)
{
//cout << "intru4";
cout << -1;
return;
}
tmp = g;
for (long long i = ind; i >= left + 1; i--)
{
if (s[i] == ':')
{
ind = i;
g++;
break;
}
}
long long right = ind;
if (g == tmp)
{
//cout << "intru3";
cout << -1;
return;
}
long long cnt = 0;
for (long long i = left; i <= right; i++)
{
if (s[i] == '|')
cnt++;
}
cout << 4 + cnt;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//int t;
//cin >> t;
//while (t--)
// solve();
solve();
return 0;
}
921. Minimum Add to Make Parentheses Valid | 881. Boats to Save People |
497. Random Point in Non-overlapping Rectangles | 528. Random Pick with Weight |
470. Implement Rand10() Using Rand7() | 866. Prime Palindrome |
1516A - Tit for Tat | 622. Design Circular Queue |
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |